On the Gittins index in the M/G/1 queue
نویسندگان
چکیده
For an M/G/1 queue with the objective of minimizing the mean number of jobs in the system, the Gittins index rule is known to be optimal among the set of non-anticipating policies. We develop properties of the Gittins index. For a single-class queue it is known that when the service time distribution is of type Decreasing Hazard Rate (New Better than Used in Expectation), the Foreground-Background (First-Come-First-Served) discipline is optimal. By utilizing the Gittins index approach, we show that in fact, Foreground-Background and First-Come-First-Served are optimal if and only if the service time distribution is of type Decreasing Hazard Rate and New Better than Used in Expectation, respectively. For the multi-class case, where jobs of different classes have different service distributions, we obtain new results that characterize the optimal policy under various assumptions on the service time distributions. We also investigate distributions whose hazard rate and mean residual lifetime are not monotonic.
منابع مشابه
Optimization of M G 1 Queue with Vacation (TECHNICAL NOTE)
This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملMaximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)
This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...
متن کاملAN M/G/1 QUEUE WITH REGULAR AND OPTIONAL PHASE VACATION AND WITH STATE DEPENDENT ARRIVAL RATE
We consider an M/G/1 queue with regular and optional phase vacation and withstate dependent arrival rate. The vacation policy is after completion of service if there are no customers in the system, the server takes vacation consisting of K -phases, each phase is generally distributed. Here the first phase is compulsory where as the other phases are optional. For this model the supplementary var...
متن کاملOn the optimality of the Gittins index rule for multi-armed bandits with multiple plays
We investigate the general multi-armed bandit problem with multiple servers. We determine a condition on the reward processes su1⁄2cient to guarantee the optimality of the strategy that operates at each instant of time the projects with the highest Gittins indices. We call this strategy the Gittins index rule for multi-armed bandits with multiple plays, or brie ̄y the Gittins index rule. We show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 63 شماره
صفحات -
تاریخ انتشار 2009